Matroid theory

Results: 338



#Item
21The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate

The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2008-11-17 17:17:16
22143 Documenta Math. The Coming of the Matroids William H. Cunningham

143 Documenta Math. The Coming of the Matroids William H. Cunningham

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2012-07-25 10:24:53
23

PDF Document

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2014-08-05 05:09:25
24Mathematical Programming I. North-Holland Publishing Company MATROIDS A N D THE G R E E D Y ALGORITHM * Jack EDMONDS National Bureau o f Standards, Washington, D.C., U.S.A.

Mathematical Programming I. North-Holland Publishing Company MATROIDS A N D THE G R E E D Y ALGORITHM * Jack EDMONDS National Bureau o f Standards, Washington, D.C., U.S.A.

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
25CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-02-18 01:28:39
26Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth Markus Bl¨aser and Christian Hoffmann Saarland University, Germany Abstract. We consider the multivariate interlace polynomial introduced by Courc

Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth Markus Bl¨aser and Christian Hoffmann Saarland University, Germany Abstract. We consider the multivariate interlace polynomial introduced by Courc

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2012-05-16 12:04:39
27Finding Textures in Sketches using Planar Ising Models Matthew D. McLure, Subu Kandaswamy, and Kenneth D. Forbus Northwestern University Abstract Creating software that can understand the range of sketches

Finding Textures in Sketches using Planar Ising Models Matthew D. McLure, Subu Kandaswamy, and Kenneth D. Forbus Northwestern University Abstract Creating software that can understand the range of sketches

Add to Reading List

Source URL: qr15.sift.net

Language: English - Date: 2015-08-11 09:14:44
28Contributions on Secretary Problems, Independent Sets of Rectangles and Related Problems Jose´ A. Soto Doctoral Thesis Defense. Department of Mathematics. M.I.T.

Contributions on Secretary Problems, Independent Sets of Rectangles and Related Problems Jose´ A. Soto Doctoral Thesis Defense. Department of Mathematics. M.I.T.

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2013-08-08 17:44:25
29Contributions on Secretary Problems, Independent Sets of Rectangles and Related Problems by José Antonio Soto Submitted to the Department of Mathematics

Contributions on Secretary Problems, Independent Sets of Rectangles and Related Problems by José Antonio Soto Submitted to the Department of Mathematics

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2013-08-08 17:44:26
30COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res

COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2014-01-17 04:55:28